Lower bounds for hot-potato permutation routing on trees
نویسندگان
چکیده
In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently large n we construct a permutation routing problem on an n-node tree for which an oblivious greedy hot-potato algorithm requires at least 2n o(n) time steps. This lower bound is also valid for the minimumdistance heuristic. Applying the charging argument of Borodin et al. [8] we establish that any greedy hot-potato algorithm routes a permutation on a tree within 2(n 1) steps.
منابع مشابه
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
In this paper, we consider hot-potato packet routing of one-to-one routing patterns on n-node trees. By applying a ‘charging argument’, we show that any greedy hot-potato algorithm routes a oneto-one routing pattern within 2(n − 1) steps. On the other hand, a trivial lower bound suggests that at least 3n/2 steps are required by any oblivious greedy algorithm. As the main contribution of the pap...
متن کاملRouting with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
In this paper we present and analyze on-line routing schemes with contant buuer size and hot-potato routing schemes for vertex-symmetric networks. In particular, we prove that for any vertex-symmetric network with n vertices, degree d, and diameter D = (log n), a randomly chosen function and any permutation can be routed in time { O(log n D), with high probability (w.h.p.), if constant size buu...
متن کاملGreedy Õ(C +D) Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit. A hotpotato routing algorithm is greedy if packets are advanced from their sources toward their destinations whenever possible. The dilation D is the longest distance a packet has to travel; the congestion C is the maximum number of packets that traverse any edge. The routing time of a routing-algor...
متن کامل5 Conclusions and Open Problems
20] T. Szymanski. An analysis of \Hot Potato" routing in a ber optic packet switched hypercube. 21] Z. Zhang and A.S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. The many-to-many routing problem studied here is symptomatic of the diiculties in analyzing hot potato algorithms. One intuitively believes that the \desired" dist ...
متن کاملNear-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...
متن کامل